Parametric Nonlinear Model Reduction Using K-Means Clustering for Miscible Flow Simulation
نویسندگان
چکیده
منابع مشابه
Randomized Dimensionality Reduction for k-Means Clustering
We study the topic of dimensionality reduction for k-means clustering. Dimensionality reduction encompasses the union of two approaches: 1) feature selection and 2) feature extraction. A feature selection-based algorithm for k-means clustering selects a small subset of the input features and then applies k-means clustering on the selected features. A feature extraction-based algorithm for k-mea...
متن کاملDimensionality Reduction for k-Means Clustering
In this thesis we study dimensionality reduction techniques for approximate k-means clustering. Given a large dataset, we consider how to quickly compress to a smaller dataset (a sketch), such that solving the k-means clustering problem on the sketch will give an approximately optimal solution on the original dataset. First, we provide an exposition of technical results of [CEM15], which show t...
متن کاملComparing Model-based Versus K-means Clustering for the Planar Shapes
In some fields, there is an interest in distinguishing different geometrical objects from each other. A field of research that studies the objects from a statistical point of view, provided they are invariant under translation, rotation and scaling effects, is known as the statistical shape analysis. Having some objects that are registered using key points on the outline...
متن کاملInternal combustion engines in cylinder flow simulation improvement using nonlinear k-ε turbulence models
The purpose of this paper is to studying nonlinear k-ε turbulence models and its advantages in internal combustion engines, since the standard k-ε model is incapable of representing the anisotropy of turbulence intensities and fails to express the Reynolds stresses adequately in rotating flows. Therefore, this model is not only incapable of expressing the anisotropy of turbulence in an engine c...
متن کاملPersistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2020
ISSN: 1110-757X,1687-0042
DOI: 10.1155/2020/3904606